package leetcode.code0329;

import leetcode.IDebug;
import leetcode.helper.HelpDebug;

public abstract class Solution329 implements IDebug {

	public abstract int longestIncreasingPath(int[][] matrix);

	@Override
	public void debug1() {
		HelpDebug.compare(4, this.longestIncreasingPath(HelpDebug.str2array1("[[9,9,4],[6,6,8],[2,1,1]]")));
	}

	@Override
	public void debug2() {
		HelpDebug.compare(4, this.longestIncreasingPath(HelpDebug.str2array1("[[3,4,5],[3,2,6],[2,2,1]]")));
	}

	@Override
	public void debug3() {
		HelpDebug.compare(1, this.longestIncreasingPath(HelpDebug.str2array1("[[1]]")));
	}

	@Override
	public void debug4() {
		// TODO Auto-generated method stub

	}

}
